Pseudo-Identities and Bordered Words
نویسندگان
چکیده
This paper investigates the notions of θ-bordered words and θ-unbordered words for various pseudo-identity functions θ. A θ-bordered word is a non-empty word u such that there exists a word v which is a prefix of u while θ(v) is a suffix of u. The case where θ is the identity function corresponds to the classical notions of bordered and unbordered words. Here we explore cases where θ is a pseudo-identity function, such as a morphism or antimorphism with the property θ = I, n ≥ 2, or a literal morphism or antimorphism. We explore properties of θ-bordered and θ-unbordered words in this context.
منابع مشابه
Nonlinear Picone identities to Pseudo $p$-Laplace operator and applications
In this paper, we derive a nonlinear Picone identity to the pseudo p-Laplace operator, which contains some known Picone identities and removes a condition used in many previous papers. Some applications are given including a Liouville type theorem to the singular pseudo p-Laplace system, a Sturmian comparison principle to the pseudo p-Laplace equation, a new Hardy type inequality with weight an...
متن کاملInvolutively Bordered Words
In this paper we study a generalization of the classical notions of bordered and unbordered words, motivated by DNA computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each...
متن کاملWatson-Crick Bordered Words and their Syntactic Monoid
DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable f...
متن کاملOn pseudoknot-bordered words and their properties
a r t i c l e i n f o a b s t r a c t We study a generalization of the classical notions of bordered and unbordered words, motivated by biomolecular computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in biomolecular computing to encode information. Due to the fact that A is Watson–Crick complementary to T and G to C, DNA single strands that are W...
متن کاملCounting Bordered Partial Words by Critical Positions
A partial word, sequence over a finite alphabet that may have some undefined positions or holes, is bordered if one of its proper prefixes is compatible with one of its suffixes. The number theoretical problem of enumerating all bordered full words (the ones without holes) of a fixed length n over an alphabet of a fixed size k is well known. In this paper, we investigate the number of bordered ...
متن کامل